A succinct canonical register automaton model
نویسندگان
چکیده
منابع مشابه
A Succinct Canonical Register Automaton Model
We present a novel canonical automaton model, based on register automata, that can be used to specify protocol or program behavior. Register automata have a finite control structure and a finite number of registers (variables), and process sequences of terms that carry data values from an infinite domain. We consider register automata that compare data values for equality. A major contribution ...
متن کاملA Succinct Canonical Register Automaton Model for Data Domains with Binary Relations
We present a novel canonical automaton model for languages over infinite data domains, that is suitable for specifying the behavior of services, protocol components, interfaces, etc. The model is based on register automata. A major contribution is a construction of succinct canonical register automata, which is parameterized on the set of relations by which elements in the data domain can be co...
متن کاملInferring Canonical Register Automata
In this paper, we present an extension of active automata learning to register automata, an automaton model which is capable of expressing the influence of data on control flow. Register automata operate on an infinite data domain, whose values can be assigned to registers and compared for equality. Our active learning algorithm is unique in that it directly infers the effect of data values on ...
متن کاملA New Kind of Finite-State Automaton: Register Vector Grammar
Register Vector Grammar is a new kind of f in i te -s ta te automaton that is sensitive to context—without, of course, being contextsensitive in the sense of Chomsky hierarchy. Traditional automata are functionally simple: symbols match by identi ty and change by replacement. RVG is functionally complex: ternary feature vectors (e.g. +-±--++) match and change by masking ( + matches but does not...
متن کاملSuccinct Representations of Model
In this paper, following the approach of Gocic, Kautz, Pa-padimitriou and Selman (1995), we consider the ability of belief revision operators to succinctly represent a certain set of models. In particular, we show that some of these operators are more eecient than others, even though they have the sane model checking complexity. We show that these operators are partially ordered, i.e. some of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logical and Algebraic Methods in Programming
سال: 2015
ISSN: 2352-2208
DOI: 10.1016/j.jlamp.2014.07.004